Lecture 8 : Public - Key Encryption

نویسنده

  • Rono Dasgupta
چکیده

In the previous lecture, we discussed the concept of Secret-Key Encryption. However, this scheme has a major limitation in the fact that the key has to be shared between the sender and the receiver before any message can be transmitted. There might be several cases where doing this is infeasible if there has been no prior communication between the sender and the receiver. In today’s lecture, we will look at an encryption scheme which provides a solution for this problem. This encryption scheme is called Public-Key Encryption. In this scheme, instead of a single shared secret key, the sender and the receiver now each have two keys a public key and a secret key. The public key can be made public without giving away any information that can reduce the overall security of the scheme. The secret key remains secret, just like in Secret-Key Encryption. When a sender wants to send a message to the receiver, she uses the public key of the receiver to encrypt it. The receiver then uses his secret key to decrypt the message. There is no secret shared between the sender and the receiver in this scheme.

منابع مشابه

K — Advanced Topics in Cryptography February 5 , 2004 Lecture 4

The focus of this lecture is efficient public-key encryption. In the previous lecture, we discussed a public-key encryption scheme for 1-bit messages. However, to encrypt an `-bit message, we can simply encrypt ` one-bit messages and send these (and we proved last time that this remains secure in the case of public-key encryption). Here, we first describe (briefly) how to combine public and pri...

متن کامل

Lecturer : Kartik Krishnan Lectures 22 - 24 Symmetric Key cryptosystem

Symmetric encryption, also referred to as conventional encryption or single key encryption was the only type of encryption in use prior to the development of public-key encryption in 1976. The symmetric encryption scheme has five ingredients (see Figure 1): 1. Plaintext: This is the original intelligible message or data that is fed to the algorithm as input. 2. Encryption algorithm: The encrypt...

متن کامل

Lecture 17 : Constructions of Public - Key Encryption

In the previous lecture, we defined Public-Key Encryption system. We now proceed to define security in these systems. Intuitively, we would like the encryptions of different messages to be indistinguishable, even when the public key is known by the adversary. be a Public-Key Encryption system over the message space M. (Gen, Enc, Dec) is said to be secure, if for all p.p.t. A there exists a negl...

متن کامل

Lecture Notes on Part Ii of Introduction to Cryptography

1.1. Why do we need probabilistic encryption? The point of probabilistic encryption is to eliminate any information leaked with public-key cryptography. Assuming a cryptanalyst has a ciphertext C = Ek(M) of message M encrypted with public key Ek and he wants to recover message M. If he guesses correctly a random message M' such that C 0 = Ek(M ) and C'=C, then he knows that M'=M. If it's wrong,...

متن کامل

Lecture 6: Overview of Public-Key Cryptography and RSA

In this lecture, we give an overview to the public-key cryptography, which is also referred to as asymmetric cryptography. We will first introduce the background of public-key cryptography. Then we will study the model of public-key cryptosystem, and the requirement to design a practical public-key algorithm. Finally, we will study the design of RSA algorithm. The concept of public-key (asymmet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015